Finding the Top-K Heavy Hitters in Data Streams: A Reconfigurable Accelerator Based on an FPGA-Optimized Algorithm
نویسندگان
چکیده
This paper presents a novel approach for accelerating the top-k heavy hitters query in data streams using Field Programmable Gate Arrays (FPGAs). Current hardware acceleration approaches rely on direct and strict mapping of software algorithms into hardware, limiting their performance practicality due to lack optimizations at an algorithmic level. The presented optimizes well-known algorithm by carefully relaxing some its requirements allow design practical scalable accelerator that outperforms current state-of-the-art accelerators while maintaining near-perfect accuracy. details implementation optimized FPGA specifically tailored computing streams. is entirely specified C language level easily reproducible with High-Level Synthesis (HLS) tools. Implementation Intel Arria 10 Stratix FPGAs HLS compiler showed promising results—outperforming prior terms throughput features.
منابع مشابه
Finding Hierarchical Heavy Hitters in Data Streams
Aggregation along hierarchies is a critical summary technique in a large variety of online applications including decision support, and network management (e.g., IP clustering, denial-of-service attack monitoring). Despite the amount of recent study that has been dedicated to online aggregation on sets (e.g., quantiles, hot items), surprisingly little attention has been paid to summarizing hier...
متن کاملFinding Subcube Heavy Hitters in Analytics Data Streams
Modern data streams typically have high dimensionality. For example, digital analytics streams consist of user online activities (e.g., web browsing activity, commercial site activity, apps and social behavior, and response to ads). An important problem is to nd frequent joint values (heavy hiers) of subsets of dimensions. Formally, the data stream consists of d-dimensional items and a k-dime...
متن کاملFinding top-k elements in data streams
Identifying the most frequent elements in a data stream is a well known and difficult problem. Identifying the most frequent elements for each individual, especially in very large populations, is even harder. The use of fast and small memory footprint algorithms is paramount when the number of individuals is very large. In many situations such analysis needs to be performed and kept up to date ...
متن کاملNew Algorithms for Heavy Hitters in Data Streams
An old and fundamental problem in databases and data streams is that of finding the heavy hitters, also known as the top-k, most popular items, frequent items, elephants, or iceberg queries. There are several variants of this problem, which quantify what it means for an item to be frequent, including what are known as the `1-heavy hitters and `2-heavy hitters. There are a number of algorithmic ...
متن کاملNew Algorithms for Heavy Hitters in Data Streams (Invited Talk)
An old and fundamental problem in databases and data streams is that of finding the heavy hitters, also known as the top-k, most popular items, frequent items, elephants, or iceberg queries. There are several variants of this problem, which quantify what it means for an item to be frequent, including what are known as the l1-heavy hitters and l2-heavy hitters. There are a number of algorithmic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12112376